Arithmetic progressions of cycles in outer-planar graphs
نویسندگان
چکیده
منابع مشابه
Removable Cycles in Planar Graphs
All graphs considered are finite and loopless, but may contain multiple edges. By a simple graph we shall mean a graph without multiple edges. It follows easily from a result of Mader [4, Theorem 1] that if G is a ^-connected simple graph of minimum degree at least k+2, then G contains a cycle C such that G-E(C) is ^-connected. Stronger results exist for the special case of 2-connected simple g...
متن کاملOn Arithmetic Progressions Of Cycle Lengths In Graphs
A recently posed question of Häggkvist and Scott’s asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by proving that for k ≥ 2, a bipartite graph of average degree at least 4k and girth g contains cycles of (g/2 − 1)k consecutive even lengths. We also obtain a s...
متن کاملPrimes in arithmetic progressions
Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-type estimates in the prime number theorem for arithmetic progressions, for all moduli k ≤ 72 and other small moduli.
متن کاملDiscrepancy in Arithmetic Progressions
It is proven that there is a two-coloring of the first n integers forwhich all arithmetic progressions have discrepancy less than const.n1/4. Thisshows that a 1964 result of K. F. Roth is, up to constants, best possible. Department of Applied Mathematics, Charles University, Malostranské nám. 25,118 00 Praha 1, Czech RepublicE-mail address: [email protected] Courant Insti...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00234-5